//import java.util.HashMap;
//import java.util.Arrays;
//import java.util.Map;
class Solution {
    public boolean isMatch(String s, String p) {
        int m=p.length();
        int n=s.length();
        s=" "+s;
        p=" "+p;
        boolean[][] dp=new boolean[m+1][n+1];
        dp[0][0]=true;
        for(int i=1;i<=m;i++){
            if(p.charAt(i)=='*') 
                dp[i][0]=true;
            else 
                break;
        }
        for(int i=1;i<=m;i++){
            for(int j=1;j<=n;j++){
                if(p.charAt(i)=='?')
                    dp[i][j]=dp[i-1][j-1];
                else if(p.charAt(i)=='*')
                    dp[i][j]=dp[i][j-1]||dp[i-1][j];
                else
                    dp[i][j]=(p.charAt(i)==s.charAt(j))?dp[i-1][j-1]:dp[i][j];
            }
        }
        return dp[m][n];
    }
}